Improved Uniform Test Error Bounds
نویسنده
چکیده
We derive distribution free uniform test error bounds that improve on VC type bounds for validation We show how to use knowledge of test inputs to improve the bounds The bounds are sharp but they require intense computation We introduce a method to trade sharpness for speed of computation Also we compute the bounds for several test cases Key wordsmachine learning learning theory generalization Vapnik Chervonenkis Computer Science Department California Institute of Technology Pasadena Cal ifornia eric cs caltech edu
منابع مشابه
Prediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions
We present a new general-purpose algorithm for learning classes of [0, 1]-valued functions in a generalization of the prediction model and prove a general upper bound on the expected absolute error of this algorithm in terms of a scale-sensitive generalization of the Vapnik dimension proposed by Alon, Ben-David, Cesa-Bianchi, and Haussler. We give lower bounds implying that our upper bounds can...
متن کاملUniform error bounds for smoothing splines
Almost sure bounds are established on the uniform error of smoothing spline estimators in nonparametric regression with random designs. Some results of Einmahl and Mason (2005) are used to derive uniform error bounds for the approximation of the spline smoother by an “equivalent” reproducing kernel regression estimator, as well as for proving uniform error bounds on the reproducing kernel regre...
متن کاملRevisiting the Nystrom method for improved large-scale machine learning
We reconsider randomized algorithms for the low-rank approximation of symmetric positive semi-definite (SPSD) matrices such as Laplacian and kernel matrices that arise in data analysis and machine learning applications. Our main results consist of an empirical evaluation of the performance quality and running time of sampling and projection methods on a diverse suite of SPSD matrices. Our resul...
متن کاملAn Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits
We present an improved simulation of space and reversal bounded Turing machines by width and depth bounded uniform circuits. (All resource bounds hold simultaneously.) An S(n) space, R(n) reversal bounded deterministic k-tape Turing machine can be simulated by a uniform circuit of O(R(n) log2S(n)) depth and O(S(n) k) width. Our proof is cleaner, and has slightly better resource bounds than the ...
متن کاملAn efficient numerical method for singularly perturbed second order ordinary differential equation
In this paper an exponentially fitted finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer. A fitting factor is introduced and the model equation is discretized by a finite difference scheme on an uniform mesh. Thomas algorithm is used to solve the tri-diagonal system. The stability of the algorithm is investigated. It ...
متن کامل